Learning First Order Quantiier Denotations an Essay in Semantic Learnability
نویسنده
چکیده
منابع مشابه
Learning First Order Quantifier Denotations An Essay in Semantic Learnability
This paper addresses the problem of how a learner would associate a denotation with a determiner on the basis of the pairing of a simple sentence with some perceptual input. Following work by van Benthem (1985), first order quantification is simulated with (a subclass of) finite state automata. Results from Angluin (1988) are used to demonstrate the learnability of this class. Comments Universi...
متن کاملMacro Grammars and Holistic Triggering for Efficient Semantic Parsing
To learn a semantic parser from denotations, a learning algorithm must search over a combinatorially large space of logical forms for ones consistent with the annotated denotations. We propose a new online learning algorithm that searches faster as training progresses. The two key ideas are using macro grammars to cache the abstract patterns of useful logical forms found thus far, and holistic ...
متن کاملA Learnable Constraint-based Grammar Formalism
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable learnability results. The learnability result for LWFGs assumes that the semantic composition constraints are learnable. In this paper, we show what are the properties and principles the semantic representation and gramm...
متن کاملLearning of Primitive Formal Systems Defining Labeled Ordered Tree Languages via Queries
Formal Graph System (FGS) is a logic programming system that deals with term graph patterns instead of terms of first-order predicate logic. In this paper, based on FGS, we introduce primitive Formal Ordered Tree System (pFOTS) as formal system defining labeled ordered tree languages. A pFOTS is defined as a set of graph rewriting rules. The query learning model is an established learning model...
متن کاملSelective Learning in the Acquisition of Kannada Ditransitives
In this article we offer up a particular linguistic phenomenon, quantifier-variable binding in Kannada ditransitives, as a proving ground upon which competing claims about learnability can be evaluated with respect to the relative abstractness of children’s grammatical knowledge. We first identify one aspect of syntactic representation that exhibits a range of syntactic, morphological, and sema...
متن کامل